Use of residual redundancy in the design of joint source/channel coders
نویسندگان
چکیده
-The need to transmit large amounts of data over a band-limited channel has led to the development of various data compression schemes. Many of these schemes function by attempting to remove redundancy from the data stream. An unwanted side-effect of this approach is to make the information transfer process more vulnerable to channel noise. Efforts at protecting against errors involve the reinsertion of redundancy and an increase in bandwidth requirements. We present a technique for providing error protection without the additional overhead required for channel coding. We start from the premise that, during source coder design, for the sake of simplicity or due to imperfect knowledge, assumptions have to be made about the source which are often incorrect. This results in residual redundancy at the output of the source coder. The residual redundancy can then be used to provide error protection in much the same way as the insertion of redundancy in convolutional coding provides error protection. In this paper we develop an approach for utilizing this redundancy. To show the validity of this approach, we apply it to image coding using DPCM, and obtain substantial performance gains, both in terms of objective as well as subjective measures.
منابع مشابه
Iterative List Decoding of Concatenated Source-Channel Codes
Whenever variable-length entropy codes are used in the presence of a noisy channel, any channel errors will propagate and cause significant harm. Despite using channel codes, some residual errors always remain, whose effect will get magnified by error propagation. Mitigating this undesirable effect is of great practical interest. One approach is to use the residual redundancy of variable-length...
متن کاملQuantization and Reconstruction of Sources with Memory
A fundamental problem in telecommunications is the reliable transmission of a source over a noisy channel. As an important result of the Shannon’s celebrated paper [1], the problem can be theoretically separated, without loss of optimality, into two parts: source coding and channel coding. However, in practise, due to the strict design constraints, such as the limitations on complexity of the s...
متن کاملIterative Source-Channel Decoding for Error-Resilient ImageTransmission Using a Markov Random Field Source Model
In this paper, we propose a joint source-channel decoding approach for the robust image transmission over wireless channels. In addition to the explicit redundancy coming from channel codes, we also use implicit residual source redundancy for error protection. The source redundancy is modeled by a Markov random field (MRF) source model, which considers the residual spatial correlation after sou...
متن کاملAn Enhanced Joint Source-Channel Decoder
Tandem coding and decoding has been demonstrated to yield arbitrarily low error rates provided a sufficiently large block length is used. When applied to practical systems that are inherently limited to a finite complexity and therefore to finite block lengths, such a strategy may be largely suboptimal. Indeed, a tandem decoding strategy ignores two types of information: the source memory and t...
متن کاملMismatch of First Order A Priori Information in Iterative Source-Channel Decoding
Due to complexity and delay constraints a usually significant amount of residual redundancy remains in the source samples after source coding. This residual redundancy can be exploited by iterative source-channel decoding for error concealment and quality improvements. One key design issue in joint source-channel (de-)coding is the index assignment. Besides conventional index assignments optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 39 شماره
صفحات -
تاریخ انتشار 1991